منابع مشابه
Lower Semicontinuity Concepts, Continuous Selections, and Set Valued Metric Projections
A number of semicontinuity concepts and the relations between them are discussed. Characterizations are given for when the (set-valued) metric projection P M onto a proximinal subspace M of a normed linear space X is approximate lower semicontinuous or 2-lower semicontinuous. A geometric characterization is given of those normed linear spaces X such that the metric projection onto every one-dim...
متن کاملΣ-products and selections of set-valued mappings
Every lower semi-continuous closed-and-convex valued mapping Φ : X → 2 , where X is a Σ-product of metrizable spaces and Y is a Hilbert space, has a single-valued continuous selection. This improves an earlier result of the author.
متن کاملParallel Algorithms for Maximal Independent Set and Maximal Matching
We present a derandomization process which leads to efficient parallel algorithms for the maximal independent set and maximal matching problems. The derandomization of the general pairs PROFIT/COST problem depends on the derandomization of the bit pairs PROFIT/COST problem which follows Luby’s approach of using an O(n) sized sample space. This simplifies the approach presented in [16].
متن کاملRegularity of Set-Valued Maps and Their Selections through Set Differences. Part 1: Lipschitz Continuity
We introduce Lipschitz continuity of set-valued maps with respect to a given set difference. The existence of Lipschitz selections that pass through any point of the graph of the map and inherit its Lipschitz constant is studied. We show that the Lipschitz property of the set-valued map with respect to the Demyanov difference with a given constant is characterized by the same property of its ge...
متن کاملA Parallel Maximal Independent Set Algorithm
The parallel construction ofmaximal independent sets is a useful building block for many algorithms in the computational sciences, including graph coloring and multigrid coarse grid creation on unstructured meshes. We present an e cient asynchronous maximal independent set algorithm for use on parallel computers, for \well partitioned" graphs, that arise from nite element (FE) models. For appro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2010
ISSN: 0166-8641
DOI: 10.1016/j.topol.2009.04.050